A Concrete Statistical Realization of Kleinberg’s Stochastic Discrimination for Pattern Recognition. Part I. Two-class Classification By

نویسندگان

  • DECHANG CHEN
  • PENG HUANG
  • XIUZHEN CHENG
  • D. CHEN
  • P. HUANG
  • X. CHENG
چکیده

The method of stochastic discrimination (SD) introduced by Kleinberg is a new method in statistical pattern recognition. It works by producing many weak classifiers and then combining them to form a strong classifier. However, the strict mathematical assumptions in Kleinberg [The Annals of Statistics 24 (1996) 2319–2349] are rarely met in practice. This paper provides an applicable way to realize the SD algorithm. We recast SD in a probabilityspace framework and present a concrete statistical realization of SD for two-class pattern recognition. We weaken Kleinberg’s theoretically strict assumptions of uniformity and indiscernibility by introducing near uniformity and weak indiscernibility. Such weaker notions are easily encountered in practical applications. We present a systematic resampling method to produce weak classifiers and then establish corresponding classification rules of SD. We analyze the performance of SD theoretically and explain why SD is overtraining-resistant and why SD has a high convergence rate. Testing results on real and simulated data sets are also given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Statistical Look at Stochastic Discrimination

Stochastic discrimination (SD) has been shown to be a useful pattern recognition tool in the literature. A large number of experiments conducted indicate that SD has a low error rate. This paper presents a statistical look at SD. We show that for two-class problems SD simply transforms the multidimensional feature vectors to points coming from two univariate normal distributions. These two univ...

متن کامل

A Simple Implementation of the Stochastic Discrimination for Pattern Recognition

The method of stochastic discrimination (SD) introduced by Kleinberg ([6,7])is a new method in pattern recognition. It works by producing weak classifiers and then combining them via the Central Limit Theorem to form a strong classifier. SD is overtraining-resistant, has a high convergence rate, and can work quite well in practice. However, some strict assumptions involved in SD and the difficu...

متن کامل

دو روش تبدیل ویژگی مبتنی بر الگوریتم های ژنتیک برای کاهش خطای دسته بندی ماشین بردار پشتیبان

Discriminative methods are used for increasing pattern recognition and classification accuracy. These methods can be used as discriminant transformations applied to features or they can be used as discriminative learning algorithms for the classifiers. Usually, discriminative transformations criteria are different from the criteria of  discriminant classifiers training or  their error. In this ...

متن کامل

A Numerical Example on the Principles of Stochastic Discrimination

Studies on ensemble methods for classification suffer from the difficulty of modeling the complementary strengths of the components. Kleinberg’s theory of stochastic discrimination (SD) addresses this rigorously via mathematical notions of enrichment, uniformity, and projectability of a model ensemble. We explain these concepts via a very simple numerical example that captures the basic princip...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003